A machine program for theorem-proving
نویسندگان
چکیده
منابع مشابه
Machine-assisted theorem-proving for software engineering
Abstnct The thesis describes the production of a large prototype proof system for Z. and a tactic Ian· guage in which the proof tactics used in a wide range of systems (ineluding the system described here) can be discussed. The dewls of the construction of the tool-using the W logic fOT Z. and implemented in 20BJ-are presented, along with an account of some of the proof taclics which enable W t...
متن کاملAccurate theorem proving for program analysis
Symbolic software analysis engines such as Slam and ESC/Java often use automatic theorem provers to implement forms of symbolic simulation. The theorem provers that are used, such as Simplify, usually combine decision procedures for the theories of uninterpreted functions, linear arithmetic, and sometimes bit vectors using techniques proposed by Nelson-Oppen or Shostak. Programming language con...
متن کاملCogent: Accurate Theorem Proving for Program Verification
Many symbolic software verification engines such as Slam and ESC/Java rely on automatic theorem provers. The existing theorem provers, such as Simplify, lack precise support for important programming language constructs such as pointers, structures and unions. This paper describes a theorem prover, Cogent, that accurately supports all ANSI-C expressions. The prover’s implementation is based on ...
متن کاملRealization of a geometry theorem proving machine
Introduction Few of those who have seen a modern high-speed digital computer digest and transform a mass of data in less time than it takes to follow the process in the mind can suppress a certain amount of speculation concerning the future of such machines. Under the assumption that the computer is operating at the mere threshhold of its capacity in performing the tasks we have thus far delega...
متن کاملAccurate Theorem Proving for Program Verification
Symbolic software verification engines such as Slam and ESC/Java often use automatic theorem provers to implement forms of symbolic simulation. The theorem provers that are used, such as Simplify, usually combine decision procedures for the theories of uninterpreted functions, linear arithmetic, and sometimes bit vectors using techniques proposed by Nelson-Oppen or Shostak. Programming language...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1962
ISSN: 0001-0782,1557-7317
DOI: 10.1145/368273.368557